Tree Representations 3
نویسنده
چکیده
Much work has gone into matrix representations of Galois groups, but there is a whole new class of naturally occurring representations that have as yet gone almost unnoticed. In fact, it is well-known in various areas of mathematics that the main sources of totally disconnected groups are matrix groups over local fields AND automorphism groups of locally finite trees [12]. It is perhaps surprising then that representations of Galois groups into the latter have been almost ignored, while at the same time Galois representations into the former have been enormously effective in resolving long-standing problems in number theory. These “tree” representations are important as regards topics such as the unramified Fontaine-Mazur conjecture [6]. This conjecture states that any p-adic representation of the Galois group G of an extension unramified at p (and ramified at only finitely many primes) should have finite image. In other words, p-adic representations say little about such Galois groups. This paper proposes the conjecture that these Galois groups should, on the other hand, have representations with large image (measured by Hausdorff dimension) in the automorphism group of a rooted tree. Thus, they might allow us to investigate the structure of the Galois group of infinite pro-p extensions (such as Hilbert p-class towers), something unapproachable by standard p-adic representation methods.
منابع مشابه
Universal Succinct Representations of Trees?
We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T , our representations support the following operations in O(1) time: (i) BP-substring(i, b), which reports the substring of length b bits (b is at most the wordsize) beginning at position i of the balanced parenthesis representation of T , (ii) DFUDS-substring(i, b), which...
متن کاملFully Dynamic Representations of Interval Graphs
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques, and its modular decomposition. After each vertex or edge modification (insertion or deletion), the algorithm determines whether the new graph is an interval graph in O(n) time, and, in the positive, updates the three...
متن کاملDynamizing Succinct Tree Representations
We consider succinct, or space-efficient, representations of ordinal trees. Representations exist that take 2n+ o(n) bits to represent a static n-node ordinal tree – close to the information-theoretic minimum – and support navigational operations in O(1) time on a RAM model; and some implementations have good practical performance. The situation is different for dynamic ordinal trees. Although ...
متن کاملSuccinct Representations of Binary Trees for Range Minimum Queries
We provide two succinct representations of binary trees that can be used to represent the Cartesian tree of an array A of size n. Both the representations take the optimal 2n + o(n) bits of space in the worst case and support range minimum queries (RMQs) in O(1) time. The first one is a modification of the representation of Farzan and Munro (SWAT 2008); a consequence of this result is that we c...
متن کاملA Subpath Kernel for Learning Hierarchical Image Representations
Tree kernels have demonstrated their ability to deal with hierarchical data, as the intrinsic tree structure often plays a discriminative role. While such kernels have been successfully applied to various domains such as nature language processing and bioinformatics, they mostly concentrate on ordered trees and whose nodes are described by symbolic data. Meanwhile, hierarchical representations ...
متن کامل